Automatic generation produced by ISE Eiffel
class
DIRECTORY_COLLECTION
General
cluster: root_cluster
description: "Objects that represent directories which have to be sorted"
create: from_path_list, make
Ancestors
LINKED_LIST [G]
Queries
after: BOOLEAN -- (from LINKED_LIST)
before: BOOLEAN -- (from LINKED_LIST)
changeable_comparison_criterion: BOOLEAN -- (from CONTAINER)
count: INTEGER -- (from LINKED_LIST)
cursor: CURSOR -- (from LINKED_LIST)
duplicate (n: INTEGER): [like Current] DIRECTORY_COLLECTION -- (from DYNAMIC_CHAIN)
exclude_bigger_than (a_size: REAL): DIRECTORY_COLLECTION
exhausted: BOOLEAN -- (from LINEAR)
Extendible: BOOLEAN -- (from DYNAMIC_CHAIN)
find_next_directory_to_size (a_size: REAL): INTEGER
first: [like item] DIRECTORY_CLASS -- (from LINKED_LIST)
for_all (test: FUNCTION [ANY, TUPLE [DIRECTORY_CLASS], BOOLEAN]): BOOLEAN -- (from LINEAR)
Full: BOOLEAN -- (from LINKED_LIST)
has (v: [like item] DIRECTORY_CLASS): BOOLEAN -- (from CHAIN)
i_th (i: INTEGER): [like item] DIRECTORY_CLASS -- (from CHAIN)
index: INTEGER -- (from LINKED_LIST)
index_of (v: [like item] DIRECTORY_CLASS; i: INTEGER): INTEGER -- (from CHAIN)
index_set: INTEGER_INTERVAL -- (from CHAIN)
infix "@" (i: INTEGER): [like item] DIRECTORY_CLASS -- (from CHAIN)
is_empty: BOOLEAN -- (from FINITE)
is_equal (other: [like Current] DIRECTORY_COLLECTION): BOOLEAN -- (from LIST)
is_inserted (v: DIRECTORY_CLASS): BOOLEAN -- (from LINKED_LIST)
isfirst: BOOLEAN -- (from LINKED_LIST)
islast: BOOLEAN -- (from LINKED_LIST)
item: DIRECTORY_CLASS -- (from LINKED_LIST)
last: [like item] DIRECTORY_CLASS -- (from LINKED_LIST)
linear_representation: LINEAR [DIRECTORY_CLASS] -- (from LINEAR)
object_comparison: BOOLEAN -- (from CONTAINER)
occurrences (v: [like item] DIRECTORY_CLASS): INTEGER -- (from CHAIN)
off: BOOLEAN -- (from LINKED_LIST)
prunable: BOOLEAN -- (from DYNAMIC_CHAIN)
readable: BOOLEAN -- (from LINKED_LIST)
sequential_occurrences (v: DIRECTORY_CLASS): INTEGER -- (from LINEAR)
sum_of_sizes: REAL
there_exists (test: FUNCTION [ANY, TUPLE [DIRECTORY_CLASS], BOOLEAN]): BOOLEAN -- (from LINEAR)
valid_cursor (p: CURSOR): BOOLEAN -- (from LINKED_LIST)
valid_cursor_index (i: INTEGER): BOOLEAN -- (from CHAIN)
valid_index (i: INTEGER): BOOLEAN -- (from CHAIN)
writable: BOOLEAN -- (from SEQUENCE)
Commands
append (s: SEQUENCE [DIRECTORY_CLASS]) -- (from CHAIN)
back -- (from LINKED_LIST)
compare_objects -- (from CONTAINER)
compare_references -- (from CONTAINER)
copy (other: [like Current] DIRECTORY_COLLECTION) -- (from LINKED_LIST)
do_all (action: PROCEDURE [ANY, TUPLE [DIRECTORY_CLASS]]) -- (from LINEAR)
do_if (action: PROCEDURE [ANY, TUPLE [DIRECTORY_CLASS]]; test: FUNCTION [ANY, TUPLE [DIRECTORY_CLASS], BOOLEAN]) -- (from LINEAR)
extend (v: [like item] DIRECTORY_CLASS) -- (from LINKED_LIST)
fill (other: CONTAINER [DIRECTORY_CLASS]) -- (from CHAIN)
finish -- (from LINKED_LIST)
force (v: [like item] DIRECTORY_CLASS) -- (from SEQUENCE)
forth -- (from LINKED_LIST)
from_path_list (a_path_list: LIST [STRING])
go_i_th (i: INTEGER) -- (from LINKED_LIST)
go_to (p: CURSOR) -- (from LINKED_LIST)
make -- (from LINKED_LIST)
merge_left (other: [like Current] DIRECTORY_COLLECTION) -- (from LINKED_LIST)
merge_right (other: [like Current] DIRECTORY_COLLECTION) -- (from LINKED_LIST)
move (i: INTEGER) -- (from LINKED_LIST)
prune (v: [like item] DIRECTORY_CLASS) -- (from DYNAMIC_CHAIN)
prune_all (v: [like item] DIRECTORY_CLASS) -- (from DYNAMIC_CHAIN)
put (v: [like item] DIRECTORY_CLASS) -- (from CHAIN)
put_front (v: [like item] DIRECTORY_CLASS) -- (from LINKED_LIST)
put_i_th (v: [like item] DIRECTORY_CLASS; i: INTEGER) -- (from CHAIN)
put_left (v: [like item] DIRECTORY_CLASS) -- (from LINKED_LIST)
put_right (v: [like item] DIRECTORY_CLASS) -- (from LINKED_LIST)
remove -- (from LINKED_LIST)
remove_left -- (from LINKED_LIST)
remove_right -- (from LINKED_LIST)
replace (v: [like item] DIRECTORY_CLASS) -- (from LINKED_LIST)
search (v: [like item] DIRECTORY_CLASS) -- (from BILINEAR)
start -- (from LINKED_LIST)
swap (i: INTEGER) -- (from CHAIN)
wipe_out -- (from LINKED_LIST)
-- Generated by ISE Eiffel --
For more details: www.eiffel.com